1 research outputs found
SOME CARTESIAN PRODUCTS OF A PATH AND PRISM RELATED GRAPHS THAT ARE EDGE ODD GRACEFUL
Let be a connected undirected simple graph of size and let be the maximum number of its order and its size. Let be a bijective edge labeling which codomain is the set of odd integers from 1 up to . Then is called an edge odd graceful on if the weights of all vertices are distinct, where the weight of a vertex is defined as the sum of all labels of edges incident to . Any graph that admits an edge odd graceful labeling is called an edge odd graceful graph. In this paper, some new graph classes that are edge odd graceful are presented, namely some cartesian products of path of length two and some circular related graphs